نمایش نتایج جستجو برای
نویسنده: Paolo Toth
موارد یافت شده: 22
1 - A heuristic procedure for the capacitated m_ring star problem (چکیده)2 - An Integer Linear Programming based heuristic approach for the capacitated m-ring-star problem (چکیده)
3 - An Electro magnetism based Metaheuristic for the unicost Set Covering Problem (چکیده)
4 - The Cost Constraint Minimum Spanning Tree and the label constrained minimum spanning tree problems (چکیده)
5 - A metaheuristic approach for the unicost set covering problem (چکیده)
6 - An electromagnetism metaheuristic for the unicost set covering problem (چکیده)
7 - An Integer Linear Programming based heuristic for the Capacitated m-Ring-Star Problem (چکیده)
8 - The Generalized Covering Salesman Problem (چکیده)
9 - Heuristic Procedures for the Generalized Covering Salesman Problem (چکیده)
10 - Variable Neighborhood Search for the Cost Constrained Minimum Label Spanning Tree and Label Constrained Minimum Spanning Tree Problems (چکیده)
11 - A solution procedure for the Generalized Covering Salesman Problem (چکیده)
12 - A Local Search procedure for the Open vehicle Routing Problem (چکیده)
13 - An ILP Improvement Procedure for the Open Vehicle Routing Problem (چکیده)
14 - Generalized Covering Salesman Problem (چکیده)
15 - A heuristic Method to solve the Capacitated m-Ring-Star Problem (چکیده)
16 - An ILP Local Search Algorithm for the Capacitated m-Ring-Star Problem (چکیده)
17 - A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization (چکیده)
18 - A heuristic procedure for the Capacitated m-Ring-Star problem (چکیده)
19 - Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems (چکیده)
20 - An ILP improvement procedure for the Open Vehicle Routing Problem (چکیده)
21 - Generalized Covering Salesman Problem (چکیده)
22 - A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization (چکیده)
